Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design

نویسندگان

  • Didier Henrion
  • Christophe Louembet
چکیده

We describe an elementary algorithm to build convex inner approximations of nonconvex sets. Both input and output sets are basic semialgebraic sets given as lists of defining multivariate polynomials. Even though no optimality guarantees can be given (e.g. in terms of volume maximization for bounded sets), the algorithm is designed to preserve convex boundaries as much as possible, while removing regions with concave boundaries. In particular, the algorithm leaves invariant a given convex set. The algorithm is based on Gloptipoly 3, a public-domain Matlab package solving nonconvex polynomial optimization problems with the help of convex semidefinite programming (optimization over linear matrix inequalities, or LMIs). We illustrate how the algorithm can be used to design fixed-order controllers for linear systems, following a polynomial approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Matrix Convex Hulls of Free Semialgebraic Sets

This article resides in the realm of the noncommutative (free) analog of real algebraic geometry – the study of polynomial inequalities and equations over the real numbers – with a focus on matrix convex sets C and their projections Ĉ. A free semialgebraic set which is convex as well as bounded and open can be represented as the solution set of a Linear Matrix Inequality (LMI), a result which s...

متن کامل

Simple Approximations of Semialgebraic Sets and their Applications to Control

Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance the solution set of linear matrix inequalities or the Schur/Hurwitz stability domains. These sets often have very complicated shapes (non-convex, and even n...

متن کامل

An Lmi Optimization Approach to the Design of Structured Linear Controllers Using a Linearization Algorithm

This paper presents a new algorithm for the design of linear controllers with special constraints imposed on the control gain matrix. This so called SLC (Structured Linear Control) problem can be formulated with linear matrix inequalities (LMI’s) with a nonconvex equality constraint. This class of prolems includes fixed order output feedback control, multi-objective controller design, decentral...

متن کامل

An algorithm for approximating nondominated points of convex multiobjective optimization problems

‎In this paper‎, ‎we present an algorithm for generating approximate nondominated points of a multiobjective optimization problem (MOP)‎, ‎where the constraints and the objective functions are convex‎. ‎We provide outer and inner approximations of nondominated points and prove that inner approximations provide a set of approximate weakly nondominated points‎. ‎The proposed algorithm can be appl...

متن کامل

A hierarchy of LMI inner approximations of the set of stable polynomials

Exploiting spectral properties of symmetric banded Toeplitz matrices, we describe simple sufficient conditions for positivity of a trigonometric polynomial formulated as linear matrix inequalities (LMI) in the coefficients. As an application of these results, we derive a hierarchy of convex LMI inner approximations (affine sections of the cone of positive definite matrices of size m) of the non...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Int. J. Control

دوره 85  شماره 

صفحات  -

تاریخ انتشار 2012